Dual Adjacency Matrix: Exploring Link Groups in Dense Networks
نویسندگان
چکیده
منابع مشابه
Dual Adjacency Matrix: Exploring Link Groups in Dense Networks
Node grouping is a common way of adding structure and information to networks that aids their interpretation. However, certain networks benefit from the grouping of links instead of nodes. Link communities, for example, are a form of link groups that describe high-quality overlapping node communities. There is a conceptual gap between node groups and link groups that poses an interesting visual...
متن کاملTHE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملVisualizing Dense Dynamic Networks with Matrix Cubes
Visualizing static networks is already difficult, but exploring dynamic networks is even more challenging due to the complexity of the tasks involved. Some require aggregation over time; others require observing the topology at one given time or tracking the evolution of edge weights. Due to this wide spectrum of tasks, one visual encoding will hardly fit all tasks effectively; multiple complem...
متن کاملMIMO Link Scheduling for Interference Cancellation in Dense Wireless Networks
This paper addresses the problem of fair scheduling of MIMO links in dense wireless network deployments where MIMO interference cancellation is carried out to optimize network performance. We formulate and solve an optimal MIMO link scheduling problem, where the goal is to maximize aggregate throughput while meeting a specified fairness criterion. Evaluations in a modified version of ns-3 show ...
متن کاملAdjacency Matrix Representation in Evolutionary Circuit Synthesis
An analog circuit synthesis method based on evolutionary circuit techniques is proposed where the chromosome in the genetic algorithm is coded through the use of adjacency matrices. The method assumes that the circuit is described at the behavioral level in order to reduce the simulation time. It is shown that adjacency matrices coding of the chromosome reduces considerably the number of anomal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2015
ISSN: 0167-7055
DOI: 10.1111/cgf.12643